Search results
36 packages found
An in-memory autocomplete package based on the trie data structure
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
Minimal trie datastructure representation
- trie
- trie-d
- auto complete
- near match
- search
- hashmatch
- node-trie
- trie-search
- keywords-search
- dynamic trie
- word search
- word
- autocomplete
- autosearch
- View more
Simple, modifiable item-title search index based on radix tries.
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
radix-trie implementation for Inverse Index Document Search.
radix-trie implementation for Inverse Index Document Search.
A redis completer using Sebastian's trie algorithm: https://gist.github.com/574044
autocomplete-trie-search is an NPM package that provides fast and efficient autocomplete suggestions for text input fields using the trie data structure. With autocomplete-trie-search, you can easily integrate autocomplete functionality into your web or m
Trie based search for autocompletes with Redis.
Trie based search for autocompletes with Redis. (support vietnamese)
Simple redis-backed library for managing and querying an autocomplete dictionary.
Customizable trie data structure built in JavaScript.
An in-memory node.js autocomplete package based on the trie data structure, based off the autocomplete module
Customizable trie data structure built in JavaScript.
Customizable trie data structure built in JavaScript.
My take on an efficient implementation of a Trie in Javascript
The extremely fast compressed trie implementation.
A utility for autocompleting words using in memory trie data structure